Quantum query complexity of graph connectivity
نویسندگان
چکیده
Harry Buhrman et al gave an Ω( √ n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for some properties stronger lower bounds exist. We give an Ω(n3/2) bound for Graph Connectivity using Andris Ambainis’ method, and an O(n3/2 log n) upper bound based on Grover’s search algorithm. In addition we study the adjacency list query model, where we have almost matching lower and upper bounds for Strong Connectivity of directed graphs.
منابع مشابه
Quantum Algorithms for Graph Connectivity and Formula Evaluation
We give a new upper bound on the quantum query complexity of deciding st-connectivity on certain classes of planar graphs, and show the bound is sometimes exponentially better than previous results. We then show Boolean formula evaluation reduces to deciding connectivity on just such a class of graphs. Applying the algorithm for st-connectivity to Boolean formula evaluation problems, we match t...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملnt - p h / 04 01 09 1 v 1 1 5 Ja n 20 04 Quantum query complexity of some graph problems ∗
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(...
متن کاملua nt - p h / 04 01 09 1 v 2 8 Ju n 20 04 Quantum query complexity of some graph problems ∗
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(...
متن کاملnt - p h / 04 01 09 1 v 2 8 J un 2 00 4 Quantum query complexity of some graph problems ∗
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003